An implicit enumeration program for zero-one integer programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Implicit Enumeration Approach for Integer Programming

This paper synthesizes the Balasian implicit enumeration approach to integer linear programming with the approach typified by LAND AND DOIG and by ROY, BEBTIER, AND NGHIEM. The synthesis results from the use of an imbedded linear program to compute surrogate constraints that are as 'strong' as possible in a sense slightly different from that originally used by GLOVBK. A simple implicit enumerat...

متن کامل

A generalized implicit enumeration algorithm for a class of integer nonlinear programming problems

Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...

متن کامل

a generalized implicit enumeration algorithm for a class of integer nonlinear programming problems

presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. the method is easy to u...

متن کامل

Hybrid Enumeration Strategies for Mixed Integer Programming

In this paper we present several algorithms which combine a partial enumeration with meta-heuristics for the solution of general mixed-integer programming problems. The enumeration is based on the primal values assignable to the integer variables of the problem. We develop some algorithms for this integration, and test them using a set of well-known benchmark problems. Key-words: Enumeration, L...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer & Information Sciences

سال: 1972

ISSN: 0091-7036,1573-7640

DOI: 10.1007/bf01108520